Integers with digits $0$ or $1$
نویسندگان
چکیده
منابع مشابه
On Binary Representations of Integers with Digits
Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized by separating nonzero digits by at least one zero. We find an explicit formula that produces the digits of the expansion of an integer n which leads us to many generalized situations. Syntactical properties of such representations are also discussed. 1. A binary number system Integers n can be wri...
متن کاملApproximate Polynomial GCD over Integers with Digits-wise Lattice
For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...
متن کاملOn the Sum of Digits of Some Sequences of Integers
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {an}n=1 that for most n the sum of the digits of an in base b is at least cb log n, where cb is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
متن کاملFactoring Integers above 100 Digits Using Hypercube Mpqs 1 Scope and Achievements
In this paper we report on further progress with the factorisation of integers using the MPQS algorithm on hypercubes and a MIMD parallel computer with 1024 T805 processors. We were able to factorise a 101 digit number from the Cunningham list using only about 65 hours computing time. We give new details about the hypercube sieve initialisation procedure and describe the structure of the factor...
متن کامل#A3 INTEGERS 12A (2012): John Selfridge Memorial Issue PERFECT POWERS WITH FEW TERNARY DIGITS
We classify all integer squares (and, more generally, q-th powers for certain values of q) whose ternary expansions contain at most three digits. Our results follow from Padé approximants to the binomial function, considered 3-adically. –Dedicated to the memory of John Selfridge.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1986
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1986-0829638-5